Janet-Like Monomial Division
نویسندگان
چکیده
In this paper we introduce a new type of monomial division called Janet-like, since its properties are similar to those of Janet division. We show that the former division improves the latter one. This means that a Janet divisor is always a Janet-like divisor but the converse is generally not true. Though Janet-like division is not involutive, it preserves all algorithmic merits of Janet division, including Noetherianity, continuity and constructivity. Due to superiority of Janet-like division over Janet division, the algorithm for constructing Gröbner bases based on the new division is more efficient than its Janet division counterpart.
منابع مشابه
Involutive Bases of Polynomial Ideals
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial the self-consistent separation of the whole set of variables into two disjoint subsets. They are cal...
متن کاملA Maple Package for Computing Groebner Bases for Linear Recurrence Relations
A Maple package for computing Gröbner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two po...
متن کاملA Maple Package for Computing Gröbner Bases for Linear Recurrence Relations
A Maple package for computing Gröbner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two po...
متن کاملOn Computing Janet Bases for Degree Compatible Orderings
We consider three modifications of our involutive algorithm for computing Janet bases. These modifications are related to degree compatible monomial orders and specify selection strategies for non-multiplicative prolongations. By using the standard data base of polynomial benchmarks for Gröbner bases software we compare the modifications and confront them with Magma that implements Faugère’s F4...
متن کاملDivision algorithms for Bernstein polynomials
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD of an arbitrary collection of univariate polynomials, and an algorithm for computing a μ-basis for the syzygy module of an arbitrary collection of univariate polynomials. Division algorithms for mult...
متن کامل